On global and local mesh refinements by a generalized conforming bisection algorithm

نویسندگان

  • Antti Hannukainen
  • Sergey Korotov
  • Michal Krízek
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Bisection Algorithm That Produces Conforming Locally Refined Simplicial Meshes

First we introduce a mesh density function that serves as a criterion to decide, where a simplicial mesh should be fine (dense) and where it should be coarse. Further, we propose a new bisection algorithm that chooses for bisection an edge in a given mesh associated with the maximum value of the mesh density function. Dividing this edge at its midpoint, we correspondingly bisect all simplices s...

متن کامل

Multithread Lepp-Bisection Algorithm for Tetrahedral Meshes

Longest edge refinement algorithms were designed to deal with the iterative and local refinement of triangulations for finite element applications. In 3-dimensions the algorithm locally refines a tetredra set Sref and some neighboring tetraedra in each iteration. The new points introduced in the mesh are midpoints of the longest edge of some tetrahedra of either of the input mesh or of some ref...

متن کامل

A new conforming mesh generator for three-dimensional discrete fracture networks

Nowadays, numerical modelings play a key role in analyzing hydraulic problems in fractured rock media. The discrete fracture network model is one of the most used numerical models to simulate the geometrical structure of a rock-mass. In such media, discontinuities are considered as discrete paths for fluid flow through the rock-mass while its matrix is assumed impermeable. There are two main pa...

متن کامل

30 Years of Newest Vertex Bisection

One aspect of adaptive mesh refinement in the finite element method for solving partial differential equations is the method by which elements are refined. In the early 1980’s the dominant method for refining triangles was the red-green algorithm of Bank and Sherman. The red refinements are the desired refinements, but will result in an incompatible mesh when used alone. The green refinements a...

متن کامل

Coupling Nonlinear Element Free Galerkin and Linear Galerkin Finite Volume Solver for 2D Modeling of Local Plasticity in Structural Material

This paper introduces a computational strategy to collaboratively develop the Galerkin Finite Volume Method (GFVM) as one of the most straightforward and efficient explicit numerical methods to solve structural problems encountering material nonlinearity in a small limited area, while the remainder of the domain represents a linear elastic behavior. In this regard, the Element Free Galerkin met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Computational Applied Mathematics

دوره 235  شماره 

صفحات  -

تاریخ انتشار 2010